منابع مشابه
LAYGEN – Automatic Analog ICs Layout Generator
This paper describes an innovative analog IC layout generation tool based on evolutionary computation techniques. The designer provides a high level layout description. This template contains placement and routing constrains and is independent from technology. This expert knowledge is used to guide an evolutionary optimization kernel during the automatic generation of the layout for the target ...
متن کاملHypergraph-Based Image Representation
An appropriate image representation induces some good image treatment algorithms. Hypergraph theory is a theory of finite combinatorial sets, modeling a lot of problems of operational research and combinatorial optimization. Hypergraphs are now used in many domains such as chemistry, engineering and image processing. We present an overview of a hypergraph-based picture representation giving muc...
متن کاملA Framework for 3D Layout Solutions Representation using OpenGL
Many researchers had worked on three dimensional (3D) optimization which presented results using numbers and graphs. This paper proposes a standard way to represent the solution naturally, in 3D graphical layout display based on OpenGL. Since container loading problem (CLP) is a common reference for 3D space optimization algorithms, we present a method to represent the 3D layout solution for CL...
متن کاملRepresentation Theorem for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the safisfiability of sets of clauses with respect to that hypergraph (see [2], [4]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملRepresentation Theorems for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design and Applications
سال: 2015
ISSN: 1686-4360
DOI: 10.1080/16864360.2014.997638